Preface This text has grown over many years from a set of class notes for an undergraduate linear programming course offered at the University of Wisconsin-Madison. Though targeted to Computer Science undergraduates, the

Source URL: www.siam.org

• Operations research
• Mathematical optimization
• Convex optimization
• Linear programming
• Quadratic programming
• Linear algebra
• Algorithm
• Quadratic

A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry

Source URL: www.daviddelaat.nl

• NP-complete problems
• Operations research
• Independent set
• Optimization problem
• Discrete geometry
• Graph
• Duality
• Packing problems
• Mathematical optimization
• Planar graphs
• Matching
• Matroid

Towards a Trichotomy for Quantified H-Coloring Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, DH1 3LE, U.K. Abstract. Hell and Neˇsetˇril proved that

Source URL: www.bedewell.com

• Graph theory
• Graph coloring
• NP-complete problems
• Graph operations
• Graph homomorphism
• Morphisms
• Bipartite graph
• Graph
• Core
• Cycle
• Matching
• Bipartite double cover

Irreversible 2-conversion set is NP-complete ∗† Jan Kynˇcl, Bernard Lidick´ y, and Tom´aˇs Vyskoˇcil

Source URL: kam.mff.cuni.cz

• Graph connectivity
• Computational complexity theory
• Gadget
• Graph
• Cycle
• Graph operations
• Tree

tria-free-after-review14.dvi

Source URL: community.dur.ac.uk

• NP-complete problems
• Graph operations
• Graph coloring
• Graph theory
• Line graph
• Clique
• Chordal graph
• Neighbourhood
• Planar graph
• Vertex
• Triangle-free graph
• Dominating set

MATHEMATICS OF OPERATIONS RESEARCH Vol. 33, No. 4, November 2008, pp. 1002–1022 issn 0364-765X
eissn
08
3304
1002 informs

Source URL: www.maths.lse.ac.uk

• Game theory
• Bayesian game
• Extensive-form game
• Strategy
• Nash equilibrium
• Normal-form game
• Solution concept
• Correlated equilibrium
• Information set
• Best response
• Determinacy
• Repeated game

Common Data Set Fundamentals and Best Practices for reporting Common Data Set (CDS) Data Stan Bernstein, Director of Survey Policy, The College Board Stephen Sauermelch, Director of Operations, Peterson’s—A Nelnet C

Source URL: www.commondataset.org

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

Source URL: homepages.cwi.nl

• Mathematics
• Algebra
• Real algebraic geometry
• Mathematical optimization
• Operations research
• Matrices
• Linear programming
• Semidefinite programming
• Polynomial
• Moment problem
• Moment matrix
• Matrix

An Efficient Simulation-based Approach to Ambulance Fleet Allocation and Dynamic Redeployment Yisong Yue and Lavanya Marla and Ramayya Krishnan iLab, H. John Heinz III College Carnegie Mellon University 5000 Forbes Ave.

Source URL: select.cs.cmu.edu

• Mathematical optimization
• Operations research
• Systems science
• Academia
• Emergency medical services
• Submodular set function
• Simulation-based optimization
• Dynamic programming
• Ambulance
• Pareto efficiency

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs Nadia M. Benbernou∗

Source URL: www.eecs.tufts.edu

• Planar graphs
• Graph connectivity
• Graph operations
• Dual graph
• Line segment
• Cut
• Convex set
• Connectivity
• Graph
• Bridge
• Planar separator theorem
• Circle packing theorem